Association Rule Generation using Modified Hashing Function
نویسندگان
چکیده
منابع مشابه
Selective association rule generation
Mining association rules is a popular and well researched method for discovering interesting relations between variables in large databases. A practical problem is that at medium to low support values often a large number of frequent itemsets and an even larger number of association rules are found in a database. A widely used approach is to gradually increase minimum support and minimum confid...
متن کاملAn Efficient Association Rule Mining Using the H-BIT Array Hashing Algorithm
Association Rule Mining (ARM) finds the interesting relationship between presences of various items in a given database. Apriori is the traditional algorithm for learning association rules. However, it is affected by number of database scan and higher generation of candidate itemsets. Each level of candidate itemsets requires separate memory locations. Hash Based Frequent Itemsets Quadratic Pro...
متن کاملRough Sets and Association Rule Generation
ASSOCIATION RULE see extraction methods have been developed as the main methods for mining of real life data in particular in Basket Data Analysis In this paper we present a novel ap proach to generation of association rule based on Rough Set and Boolean reasoning methods We show the relationship between the problems of association rule extraction for transaction data and relative reducts or re...
متن کاملHiding Sensitive Association Rule Using Clusters of Sensitive Association Rule
The security of the large database that contains certain crucial information, it will become a serious issue when sharing data to the network against unauthorized access. Association rules hiding algorithms get strong and efficient performance for protecting confidential and crucial data. The objective of the proposed Association rule hiding algorithm for privacy preserving data mining is to hi...
متن کاملRule Generation using Decision Trees
A DT is a classification scheme which generates a tree and a set of rules, representing the model of different classes, from a given dataset. As per Hans and Kamber [HK01], DT is a flow chart like tree structure, where each internal node denotes a test on an attribute, each branch represents an outcome of the test and leaf nodes represent the classes or class distributions. The top most node in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16561-5849